Direct- or Fast-Access Decoding Schemes for VF Codes

نویسندگان

  • Hirosuke Yamamoto
  • Yuka Kuwaori
چکیده

In this paper, we propose two schemes, which enable any VF code to realize director fast-access decoding for any long source sequence. Direct-access decoding means that any source symbol of any position can be directly decoded within constant time, not depending on the length of source sequence N , without decoding the whole codeword sequence. We also evaluate the memory size necessary to realize directaccess decoding or fast-access decoding with decoding delayO(log log N ), O(log N ), and so on, in the proposed schemes. key words: VF code, direct-access decoding, rank function, select function

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Complexity Analysis of Reed-Solomon Decoding over GF(2^m) Without Using Syndromes

For the majority of the applications of ReedSolomon (RS) codes, hard decision decoding is based on syndromes. Recently, there has been renewed interest in decoding RS codes without using syndromes. In this paper, we investigate the complexity of syndromeless decoding for RS codes, and compare it to that of syndrome-based decoding. Aiming to provide guidelines to practical applications, our comp...

متن کامل

Concatenated Codes with Two Inner Coding Schemes in Frequency-Hopping Spread Spectrum Multiple-Access Channels

In this paper, we analyze the performance of a concatenated code with two different inner decoding schemes. One is the errordetecting inner coding, and the other is the error-detecting-and-correcting inner coding scheme. We compare the performance of the two decoding schemes for finite and infinite block length cases when the concatenated code is applied to slow frequency-hopping spread-spectru...

متن کامل

Falcon Codes: Fast, Authenticated LT Codes

In this paper, we introduce Falcon codes, a class of authenticated error correcting codes that are based on LT codes [23] and achieve the following properties, for the first time simultaneously: (1) with high probability, they can correct adversarial symbol corruptions in the encoding of a message, and (2) they allow for very efficient encoding and decoding times, even linear in the message len...

متن کامل

Collaborative coding and decoding techniques for multiple access channel - Communications, IEE Proceedings-

It is highly desirable to use simple and effective multiple access coding and decoding techniques which are capable of multiple access function and error control. The collaborative coding multiple access (CCMA) techniques potentially permit effcient simultaneous transmission by several users sharing a common channel, without subdivision in time, frequency or orthogonal codes. The authors invest...

متن کامل

A fast decoding method for prefix codes - Data Compression Conference, 2003. Proceedings. DCC 2003

Prefix codes exert a major role in well known compression schemes. They allow a text to be decoded without ambiguity, since they are variable-length codes where no codeword is a prefix of other. The problem of improving their decoding speed has received a special attention in the data compression community. Among the several techniques that have been proposed, Table Look-up is one of the most e...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • IEICE Transactions

دوره 99-A  شماره 

صفحات  -

تاریخ انتشار 2016